Dan Boneh
نویسندگان
چکیده
To present the application of the XOR Theorem to learning theory we rst give the following two de nitions. Let F be a class of boolean functions and let > 0. A strong learning algorithm for F over the uniform distribution queries the function f : f0; 1gn ! f0; 1g and outputs, with probability at least 1 , a circuit C such that Pr[f(x) 6= C(x)] < 1 nO(1) where Pr is the uniform distribution. The algorithm is said to be polynomial if it is polynomial in n; ln 1 .
منابع مشابه
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
Education 06/18 Stanford University (expected) Ph.D. in Computer Science (Specialization: Cryptography and Computer Security) Advised by Dan Boneh 06/13 Stanford University M.S. in Computer Science (Specialization: Artificial Intelligence) 06/13 Stanford University B.S. in Computer Science with Honors and Distinction, Minor in Physics Honors Thesis: End-to-End Text Recognition with Convolutiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007